| 1. | At the same time , the algorithm complexities were also analyzed
该算法适用于时间表在现实环境中的各种应用。 |
| 2. | Because of the characteristic of fft , a new recursion method is designed in the paper . and then the algorithm complexity is analyzed
最后,在图像的编码方面,本文选用了常见的哈夫曼编码方法进行并行算法的设计。 |
| 3. | Again , if the analysis engine knows if loading coils are allowed , and , if so , how they may be present , algorithm complexity can be eased
再次地，如果分析引擎知道是否允许负载线圈，如果有的话，他们是如何安装的，即能降低算法复杂性。 |
| 4. | The major challenges of real - time implementation with digital signal processing techniques lie in the algorithm complexity and high data rate of radar
由于算法本身的复杂度和雷达数据的高速率，方位向处理的实时实现具有很大的挑战性。 |
| 5. | Moreover , this theory can change the problem in non - linearity space to that in the linearity space in order to reduce the algorithm complexity by using the kernel function idea
又由于采用了核函数思想，使它把非线性空间的问题转换到线性空间，降低了算法的复杂度。 |
| 6. | Model scale and algorithm complexity are also discussed in details . in order to decrease the scale and difficulty , a series of heuristic rules are adopted during solution
文中同时对模型的规模和算法的复杂性进行了详细的分析，为了降低问题求解的规模和难度，提出了一系列启发式规则。 |
| 7. | In this article , the auther evaluated the mimimal path sets between two nodes with the conection matrix determinant , not the tranditional matrix square function , which greatly reduced the algorithm complexity
本文用联络矩阵的行列式运算代替传统的矩阵乘方运算来求网络两点之间正常的状态集合，进而求出网络系统的可靠度，极大的减少了运算的复杂性。 |
| 8. | For the case of all jobs with constant processing time , corresponding to the case when there are only a constant number of job release times and the general released case , we provide two optimal algorithms and analysis their algorithm complexity
对于所有工件的加工时间都相等的情况，分别对常数个到达时间和任意个到达时间的情况给出了两个最优算法，并给出了其算法复杂性。 |
| 9. | An alternate proof about its existence and uniqueness and its explicit represention are given , especially the rational interpolation formulas for simple konts and double konts , and the algorithm complexity in case of double konts is improved from o ( n ~ 2 ) to o ( n )
首先,介绍了cv ( cauchy - vandermonde )有理函数插值公式,给出了cv有理函数空间上插值问题解的存在唯一性定理的另一种简单证明和显式表示 |
| 10. | Moreover , this theory can change the problem in non - linearity space to that in the linearity space in order to reduce the algorithm complexity by using the kernel function idea . svm have become the hotspot of machine learning because of their excellent learning performance
由于采用了结构风险最小化原则代替经验风险最小化原则，使得较好的解决了小样本学习的问题；又由于采用了核函数思想，使它把非线性空间的问题转换到线性空间，降低了算法的复杂度。 |
